On Berinde’s method for comparing iterative processes
نویسندگان
چکیده
Abstract In the literature there are several methods for comparing two convergent iterative processes same problem. this note we have in view mostly one introduced by Berinde (Fixed Point Theory Appl. 2:97–105, 2004) because it seems to be very successful. fact, if IP1 and IP2 converging element, then is faster than sense of Berinde. The aim prove almost obvious assertion discuss briefly papers that cite mentioned Berinde’s paper use his method processes.
منابع مشابه
A New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملThe spectral iterative method for Solving Fractional-Order Logistic Equation
In this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. This approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. The method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...
متن کاملIterative scheme based on boundary point method for common fixed point of strongly nonexpansive sequences
Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...
متن کاملOn the modification of the preconditioned AOR iterative method for linear system
In this paper, we will present a modification of the preconditioned AOR-type method for solving the linear system. A theorem is given to show the convergence rate of modification of the preconditioned AOR methods that can be enlarged than the convergence AOR method.
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Algorithms for Sciences and Engineering
سال: 2021
ISSN: ['2730-5422']
DOI: https://doi.org/10.1186/s13663-020-00685-x